Arithmetic Circuits and Counting Complexity Classes
نویسنده
چکیده
• Innovative work by Kabanets and Impagliazzo [KI03] shows that, in some cases, providing lower bounds on arithmetic circuit size can yield consequences about Boolean complexity classes. For instance, one of the most important problems in BPP that is not known to be in P is Arithmetic Circuit Identity Testing (ACIT), the problem of determining if two arithmetic circuits compute the same function. They show that the Boolean complexity of this problem is intimately linked to the arithmetic complexity of the Permanent.
منابع مشابه
Bounded Depth Arithmetic Circuits: Counting and Closure
Constant-depth arithmetic circuits have been defined and studied in [AAD97, ABL98]; these circuits yield the function classes #AC and GapAC. These function classes in turn provide new characterizations of the computational power of threshold circuits, and provide a link between the circuit classes AC (where many lower bounds are known) and TC (where essentially no lower bounds are known). In th...
متن کاملApproximate counting in bounded arithmetic
We develop approximate counting of sets definable by Boolean circuits in bounded arithmetic using the dual weak pigeonhole principle (dWPHP(PV )), as a generalization of results from [15]. We discuss applications to formalization of randomized complexity classes (such as BPP , APP , MA, AM ) in PV1 + dWPHP(PV ).
متن کاملMonomials, multilinearity and identity testing in simple read-restricted circuits
We study the problem of testing if the polynomial computed by an arithmetic circuit is identically zero. We give a deterministic polynomial time algorithm for this problem when the inputs are read-twice or readthrice formulas. In the process, these algorithms also test if the input circuit is computing a multilinear polynomial. We further study three related computational problems on arithmetic...
متن کاملBoolean complexity classes vs. their arithmetic analogs
This paper provides logspace and small circuit depth analogs of the result of Valiant and Vazirani, which is a randomized (or nonuniform) reduction from NP to its arithmetic analog ⊕P . We show a similar randomized reduction between the Boolean classes NL and semiunbounded fan-in Boolean circuits and their arithmetic counterparts. These reductions are based on the Isolation Lemma of Mulmuley, V...
متن کاملIdentity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs
We study the problem of testing if the polynomial computed by an arithmetic circuit is identically zero (ACIT). We give a deterministic polynomial time algorithm for this problem when the inputs are read-twice formulas. This algorithm also computes the MLIN predicate, testing if the input circuit computes a multilinear polynomial. We further study two related computational problems on arithmeti...
متن کامل